Left regular representation of slq(3): reduction and intertwiners

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

THE LEFT REGULAR REPRESENTATION OF A COMMUTATIVE SEPARATIVE SEMIGROUP

In this paper, a commutative semigroup will be written as a disjoint union of its cancellative subsemigroups. Based on this fact we will define the left regular representation of a commutative separative semigroup and show that this representation is faithful. Finally concrete examples of commutative separative semigroups, their decompositions and their left regular representations are given.

متن کامل

Reduction and Intertwiners

Reduction of the left regular representation of quantum algebra slq(3) is studied and q-difference intertwining operators are constructed. The irreducible representations correspond to the spaces of local sections of certain line bundles over the q-flag manifold.

متن کامل

the left regular representation of a commutative separative semigroup

in this paper, a commutative semigroup will be written as a disjoint :union: of its cancellative subsemigroups. based on this fact we will define the left regular representation of a commutative separative semigroup and show that this representation is faithful. finally concrete examples of commutative separative semigroups, their decompositions and their left regular representations are given.

متن کامل

Representation of (Left) Ideal Regular Languages by Synchronizing Automata

We follow language theoretic approach to synchronizing automata and Černý’s conjecture initiated in a series of recent papers. We find a precise lower bound for the reset complexity of a principal ideal languages. Also we show a strict connection between principal left ideals and synchronizing automata. We characterize regular languages whose minimal deterministic finite automaton is synchroniz...

متن کامل

Reduction of symmetric semidefinite programs using the regular *-representation

Abstract. We consider semidefinite programming problems on which a permutation group is acting. We describe a general technique to reduce the size of such problems, exploiting the symmetry. The technique is based on a low-order matrix ∗-representation of the commutant (centralizer ring) of the matrix algebra generated by the permutation matrices. We apply it to extending a method of de Klerk et...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics A: Mathematical and General

سال: 1995

ISSN: 0305-4470,1361-6447

DOI: 10.1088/0305-4470/28/10/014